Intersections with random geometric objects

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersections with random geometric objects

We present a systematic study of the expected complexity of the intersection of geometric objects. We first study the expected size of the intersection between a random Voronoi diagram and a generic geometric object that consists of a finite collection of line segments in the plane. Using this result, we explore the intersection complexity of a random Voronoi diagram with the following target o...

متن کامل

Reconstructing Geometric Objects from the Measures of Their Intersections with Test Sets

Let us say that an element of a given family A of subsets of R can be reconstructed using n test sets if there exist T1, . . . , Tn ⊂ R such that whenever A,B ∈ A and the Lebesgue measures of A∩ Ti and B ∩ Ti agree for each i = 1, . . . , n then A = B. Our goal will be to find the least such n. We prove that ifA consists of the translates of a fixed reasonably nice subset of R then this minimum...

متن کامل

Matching of Polygon Objects by Optimizing Geometric Criteria

Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....

متن کامل

Geometric Motion Planning: Finding Intersections

We investigate a new model for mobile agents: Motion planning with geometric primitives, similar to rulerand-circle constructions in classical geometry. In this first paper on this subject, we consider finding intersection points between two geometric objects using mobile agents that move on these objects. This amounts to finding the rendezvous point of the two agents.

متن کامل

Intersections of Random Lines

We have three overlapping planar sets within a bounded window. These sets do not have to be convex, or even connected domains. We find a simple expression for the probability that random straight lines across two of the sets intersect within the third. The lines are taken uniformly at random from beams of parallel lines, with the orientations of the beams from an arbitrary joint distribution. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 1998

ISSN: 0925-7721

DOI: 10.1016/s0925-7721(98)00004-2